on residually finite semigroups of cellullar automata
نویسندگان
چکیده
we prove that if $m$ is a monoid and $a$ a finite set with more than one element, then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$.
منابع مشابه
On Residually Finite Semigroups of Cellullar Automata
We prove that if M is a monoid and A a finite set with more than one element, then the residual finiteness of M is equivalent to that of the monoid consisting of all cellular automata over M with alphabet A.
متن کاملOn Residually Finite Knot Groups
The residual finiteness of the class of groups of fibred knots, or those knot groups with finitely generated and, therefore, free commutator subgroups, has been known for some time. Using Baumslag's results on absolutely parafree groups, this paper extends the result to twist knots (Whitehead doubles of the trivial knot) and certain other classes of nonfibred knots whose minimal spanning surfac...
متن کاملOn Residually Finite Knot Groups
The residual finiteness of the class of groups of fibred knots, or those knot groups with finitely generated and, therefore, free commutator subgroups, has been known for some time. Using Baumslag's results on absolutely parafree groups, this paper extends the result to twist knots (Whitehead doubles of the trivial knot) and certain other classes of nonfibred knots whose minimal spanning surfac...
متن کاملDeciding Word Problems of Semigroups using Finite State Automata
We explore natural classes of finitely generated semigroups that have word problem decidable by synchronous or asynchronous two-tape finite state automata. Synchronous two-tape automata decide regular word problems and asynchronous automata decide rational word problems. We argue that asynchronous two-tape automata are a more suitable choice than synchronous two-tape automata and show that the ...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملFinite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
ON NON-EMPTY WORDS IN FINITE AUTOMATA PÁL DÖMÖSI, CHRYSTOPHER L. NEHANIV, AND JOHN L. RHODES ABSTRACT. This paper relates classes of finite automata under various feedback products to some well-known pseudovarieties of finite semigroups via a study of their irreducible divisors (in the sense of Krohn-Rhodes). In particular, this serves to relate some classical results of Krohn, Rhodes, Stiffler...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of group theoryناشر: university of isfahan
ISSN 2251-7650
دوره 4
شماره 2 2015
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023